Predicting Triadic Closure in Networks Using Communicability Distance Functions
نویسندگان
چکیده
منابع مشابه
Predicting triadic closure in networks using communicability distance functions
We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions that account for the “goodness” of communication between nodes in the network. We study 25 real-world networks and show that the proposed method predicts correctly 20% of triadic closures in these networks, in contrast...
متن کاملHomophily and Triadic Closure in Evolving Social Networks
We present a new network model accounting for homophily and triadic closure in the evolution of social networks. In particular, in our model, each node is characterized by a number of features and the probability of a link between two nodes depends on common features. The bipartite network of the actors and features evolves according to a dynamics that depends on three parameters that respectiv...
متن کاملUncovering the Formation of Triadic Closure in Social Networks
The triad is one of the most basic human groups in social networks. Understanding factors affecting the formation of triads will help reveal the underlying mechanisms that govern the emergence and evolution of complex social networks. In this paper, we study an interesting problem of decoding triadic closure in social networks. Specifically, for a given closed triad (a group of three people who...
متن کاملA Will Triadic Closure Strengthen Ties in Social Networks?
The social triad—a group of three people—is one of the simplest and most fundamental social groups. Extensive network and social theories have been developed to understand its structure, such as triadic closure and social balance. Over the course of a triadic closure—the transition from two ties to three among three users, the strength dynamics of its social ties, however, are much less well un...
متن کاملTriadic closure dynamics drives scaling-laws in social multiplex networks
Social networks exhibit scaling laws for several structural characteristics, such as degree distribution, scaling of the attachment kernel and clustering coefficients as a function of node degree. A detailed understanding if and how these scaling laws are inter-related is missing so far, let alone whether they can be understood through a common, dynamical principle. We propose a simple model fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 2015
ISSN: 0036-1399,1095-712X
DOI: 10.1137/140996768